Explicit Capacity Approaching Coding for Interactive Communication

Coding for interactive communication

Let the input to a computation problem be split between two processors connected by a commu nication link and let an interactive protocol be known by which on any input the processors can solve the problem using no more than T transmissions of bits between them provided the channel is noiseless in each direction We study the following question if in fact the channel is noisy what is the e ect u...

Efficiently Coding for Interactive Communication

In 1992, Schulman [11] proved a coding theorem for interactive communication and demonstrated that interactive communication protocols can be made robust to noise with only a constant slow-down (for a sufficiently small error rate) through a black-box reduction. However, this scheme is not computationally efficient: the running time to construct a good distance tree code (and perform encoding a...

Coding for interactive communication beyond threshold adversaries

We revisit the setting of coding for interactive communication, CIC, (initiated by Schulman 96') for non-threshold tampering functions. In a nutshell, in the (special case of) the communication complexity setting, Alice and Bob holding inputs x, y wish to compute a function g(x, y) on their inputs over the identity channel using an interactive protocol. The goal here is to minimize the total co...

Coding for Interactive Communication: A Survey

Balancing Communication for Multi-party Interactive Coding

We consider interactive coding in a setting where n parties wish to compute a joint function of their inputs via an interactive protocol over imperfect channels. We assume that adversarial errors can comprise a O( 1 n ) fraction of the total communication, occurring anywhere on the communication network. Our goal is to maintain a constant multiplicative overhead in the total communication requi...